An Algorithm for Combining Decomposable Graphical Models
نویسندگان
چکیده
We propose an algorithm for combining decomposable graphical models and apply it for building decomposable graphical log-linear models which involve a large number of variables. A main idea in this algorithm is that we group the random variables that are involved in the data into several subsets of variables, build graphical log-linear models for the marginal data, and then combine the marginal models using graphs of prime separators (section 2). The application of the algorithm to a data set of 40 binary variables is very successful, yielding a model which is mostly the same as the true one.
منابع مشابه
Algorithms for Learning Decomposable Models and Chordal Graphs
Decomposable dependency models and their graphical counterparts, i.e., chordal graphs, possess a number of interesting and useful properties. On the basis of two character izations of decomposable models in terms of independence relationships, we develop an exact algorithm for recovering the chordal graphical representation of any given decom posable model. We also propose an algorithm for le...
متن کاملLearning Gaussian Graphical Models With Fractional Marginal Pseudo-likelihood
We propose a Bayesian approximate inference method for learning the dependence structure of a Gaussian graphical model. Using pseudo-likelihood, we derive an analytical expression to approximate the marginal likelihood for an arbitrary graph structure without invoking any assumptions about decomposability. The majority of the existing methods for learning Gaussian graphical models are either re...
متن کاملBayesian inference for Gaussian graphical models beyond decomposable graphs
Bayesian inference for graphical models has received much attention in the literature in recent years. It is well known that when the graph G is decomposable, Bayesian inference is significantly more tractable than in the general non-decomposable setting. Penalized likelihood inference on the other hand has made tremendous gains in the past few years in terms of scalability and tractability. Ba...
متن کاملLearning Decomposable Models for Classification
In some situations graphical models are learned to be used for classification of one given variable. The standard learning algorithms usually do not take this background knowledge into account. In the case of Bayesian networks this knowledge is often incorporated by assuming that the target variable will have no parents. This leads to discovering potentially bigger Markov boundaries of the targ...
متن کاملAn Approximate Formulation based on Integer Linear Programming for Learning Maximum Weighted (k+1)-order Decomposable Graphs
In this work we deal with the problem of learning a maximum weighted (k + 1)order decomposable graph coarser than a given maximal k-order decomposable graph. An Integer Linear Programming formulation for the problem has been recently proposed and used in order to solve instances of the problem with a moderate number of vertices [8]. However, as the problem is known to be NP-hard, it is of pract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007